Phase I: Mechanization and Rationalization of Labor

Planware has several types of knowledge, all encoded through parameterized theories. The first is knowledge of the scheduling domain, including the constraints on use of the different types of resources, such as reusable or sharable resources. Another type of knowledge is algorithm knowledge, such as generate-and-test, branch-and-bound, divide-and-conquer, dynamic programming, and hill-climbing (see ALGORITHMS, DESIGN AND CLASSIFICATION OF). By codifying them as parameterized theories, algorithms can be automatically derived for a given very-high-level problem specification, given appropriate domain axioms. A third type of knowledge is implementation knowledge, which defines how higher-level constructs such as sets can be encoded as more implementation-level constructs such as lists or bit-vectors.